On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
نویسندگان
چکیده
We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.
منابع مشابه
On the Axiomatizability of Impossible Futures
A general method is established to derive a ground-complete axiomatization for a weak semantics from such an axiomatization for its concrete counterpart, in the context of the process algebra BCCS. This transformation moreover preserves ω-completeness. It is applicable to semantics at least as coarse as impossible futures semantics. As an application, groundand ω-complete axiomatizations are de...
متن کاملSolution of Harmonic Problems with Weak Singularities Using Equilibrated Basis Functions in Finite Element Method
In this paper, Equilibrated Singular Basis Functions (EqSBFs) are implemented in the framework of the Finite Element Method (FEM), which can approximately satisfy the harmonic PDE in homogeneous and heterogeneous media. EqSBFs are able to automatically reproduce the terms consistent with the singularity order in the vicinity of the singular point. The newly made bases are used as the compliment...
متن کاملLiveness, Fairness and Impossible Futures
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same “AGEF” properties: temporal logic properties saying that reaching a desired outcome is not doomed to fail. We show that this equivalence, with an added root condition, is the coarsest congruence containing weak bisimilarity with explicit divergence that respec...
متن کاملAxiomatizing Weak Ready Simulation Semantics over BCCSP
Ready simulation has proven to be one of the most significant semantics in process theory. It is at the heart of a number of general results that pave the way to a comprehensive understanding of the spectrum of process semantics. Since its original definition by Bloom, Istrail and Meyer in 1995, several authors have proposed generalizations of ready simulation to deal with internal actions. How...
متن کاملAtomic Data Access in Distributed Hash Tables
While recent proposals for distributed hashtables address the crucial issues of communication efficiency and load balancing in dynamic networks, they do not guarantee strong semantics on concurrent data accesses. While it is well known that guaranteeing availability and consistency in an asynchronous and failure prone network is impossible, we believe that guaranteeing atomic semantics is cruci...
متن کامل